How to Elect a Representative Committee Using Approval Balloting

نویسندگان

  • D. Marc Kilgour
  • Steven J. Brams
  • M. Remzi Sanver
چکیده

Approval balloting is applied to the problem of electing a representative committee. We demonstrate several procedures for determining a committee based on approval ballots, paying particular attention to weighting methods that can reduce the in¤uence of voters with extreme views. We show that a general class of voting systems based on approval ballots can be implemented through analysis of appropriate tables. A by-product of this procedure is a clari£cation of the complexity of these systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Electing Committees by Approval Balloting

We study committee election models where voters' approvals over candidates are collected and the election outcome is determined according to a predetermined voting rule, in particular issue-wise majority rule. The properties of these models are investigated with a special attention to representativeness of the election outcomes, where representativeness relates to the way they are consistent wi...

متن کامل

Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem

In this paper we address the problem of electing a committee among a set of m candidates and on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as many candidates as she/he likes by expressing a preference profile (boolean m-vector). In order to elect a committee, a voting rule must be established to ‘transform’ the n vot...

متن کامل

Computational Aspects of Multi-Winner Approval Voting

We study computational aspects of three prominent voting rules that use approval ballots to elect multiple winners. These rules are satisfaction approval voting, proportional approval voting, and reweighted approval voting. We first show that computing the winner for proportional approval voting is NP-hard, closing a long standing open problem. As none of the rules are strategyproof, even for d...

متن کامل

Sub-committee Approval Voting and Generalised Justified Representation Axioms

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting (SCV) that simultaneously generalizes these settings. We then focus on sub-committee voting with approvals and propose extensions of the justified representa...

متن کامل

ar X iv : 1 71 1 . 06 03 0 v 1 [ cs . G T ] 1 6 N ov 2 01 7 Sub - committee Approval Voting and Generalised Justified Representation Axioms

Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting (SCV) that simultaneously generalizes these settings. We then focus on sub-committee voting with approvals and propose extensions of the justified representa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005